package problem55;

//55.跳跃游戏
//https://leetcode.cn/problems/jump-game/

class Solution {
    public boolean canJump(int[] nums) {
        int n = nums.length;
        int left = 0, right = 0, maxPos = 0;
        while(left <= right) {
            if(maxPos >= n-1) return true;
            for(int i = left; i<=right; i++) {
                maxPos = Math.max(maxPos, i + nums[i]);
            }
            left = right+1;
            right = maxPos;
        }
        return false;
    }
}